Interacting State Machines for Mobility

نویسندگان

  • Thomas A. Kuhn
  • David von Oheimb
چکیده

We present two instantiations of generic Interactive State Machines (ISMs) with mobility features which are useful for modeling and verifying dynamically changing mobile systems. ISMs are automata with local state exchanging messages simultaneously on multiple buffered ports. A system of generic ISMs also deals with global state used e.g. to describe their communication topology. We introduce Ambient ISMs (AmbISMs) whose features include hierarchical environments, migration, and locality constraints on communication. In this way we give an alternative operational semantics to the (boxed) ambient calculus. Moreover, we combine AmbISMs with dynamic ISMs which introduce dynamic communication structures and ISM activation and deactivation, as defined in an accompanying paper. All ISM variants have been defined formally within the theorem prover Isabelle/HOL and provide an easy to learn description language for the development, documentation and verification of mobile systems. We motivate our development by a running example from the field of mobile agent systems, giving a reference specification using the boxed ambient calculus and comparing it with the formulation within our (dynamic) Ambient ISM approach, which we describe in detail.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

Formal Semantics for Interacting UML subsystems

State Machines Formal semantics for large part of UML using Abstract State Machines (Gurevich). Transition systems. States: multi-sorted first-order structures (set with function names and function interpretations). ASM: set of states (incl. initial state) and update rule. Jan Jürjens, TU Munich: Formal Semantics for Interacting UML subsystems 6 Abstract State Machines: Update rules Update rule...

متن کامل

Decision problems for interacting finite state machines

Given a system of n interacting finite state machines (FSM’s) and a state configuration, the reachability problem is to examine whether this configuration is reachable within the system. We investigate the complexity of this decision problem and three of its derivatives, namely l) verifying system determinism, 2) testing for the existence of unspecified inputs to any FSM within the system, and ...

متن کامل

Ambient Abstract State Machines with applications

We define a flexible abstract ambient concept which turned out to support current programmming practice, in fact can be instantiated to apparently any environment paradigm in use in frameworks for distributed computing with heterogeneous components. For the sake of generality and to also support rigorous high-level system design practice we give the definition in terms of Abstract State Machine...

متن کامل

State Capacity, Capital Mobility, and Tax Competition

Abstract The theory of international tax competition suggests that governments attempt to attract mobile capital bases by undercutting the foreign capital tax rate. An analysis of the role that state capacity plays in tax policymaking under international pressures is, however, missing. The central contribution of our study is to highlight the importance of the interaction between state capaci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003